Recent developments in permutation decoding
نویسنده
چکیده
Recent advances in technology have produced a requirement for new implementations of good error-correcting codes. Such applications of codes also require efficient encoding and decoding methods. The method of permutation decoding was first developed by Jessie MacWilliams in the early 60’s and can be used when a linear code has a sufficiently large automorphism group to ensure the existence of a set of automorphisms, called a PD-set, that has some specific properties. This paper will give a brief survey of permutation decoding and some recent results in the search for PD-sets.
منابع مشابه
Permutation decoding for codes from designs, finite geometries and graphs
The method of permutation decoding was first developed by MacWilliams in the early 60’s and can be used when a linear code has a sufficiently large automorphism group to ensure the existence of a set of automorphisms, called a PD-set, that has some specifed properties. These talks will describe some recent developments in finding PD-sets for codes defined through the row-span over finite fields...
متن کاملExtending LP-Decoding for Permutation Codes from Euclidean to Kendall tau Metric
Invented in the 1960’s, permutation codes have reemerged in recent years as a topic of great interest because of properties making them attractive for certain modern technological applications. In 2011 a decoding method called LP (linear programming) decoding was introduced for a class of permutation codes with a Euclidean distance induced metric. In this paper we comparatively analyze the Eucl...
متن کاملPartial permutation decoding for codes from Paley
We examine codes from the Paley graphs for the purpose of permutation decoding and observe that after a certain length, PD-sets to correct errors up to the code’s error-capability will not exist. In this paper we construct small sets of permutations for correcting two errors by permutation decoding for the case where the codes have prime length.
متن کاملPartial permutation decoding for binary linear Hadamard codes
Permutation decoding is a technique which involves finding a subset S, called PDset, of the permutation automorphism group PAut(C) of a code C in order to assist in decoding. A method to obtain s-PD-sets of size s + 1 for partial permutation decoding for the binary linear Hadamard codes Hm of length 2 m, for all m ≥ 4 and 1 < s ≤ b(2m −m− 1)/(1 + m)c, is described. Moreover, a recursive constru...
متن کاملOn the permutation decoding for binary linear and Z4-linear Hadamard codes
Permutation decoding is a technique, introduced in [3] by MacWilliams, that strongly depends on the existence of special subsets, called PD-sets, of the permutation automorphism group PAut(C) of a linear code C. In [2], it is shown how to find s-PD-sets of minimum size s + 1 for partial permutation decoding for the binary simplex code Sm of length 2 − 1, for all m ≥ 4 and 1 < s ≤ ⌊ 2−m−1 m ⌋ . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006